Stirling Numbers of Uniform Trees and Related Computational Experiments

نویسندگان

چکیده

The Stirling numbers for graphs provide a combinatorial interpretation of the number cycle covers in given graph. problem generating all or enumerating these quantities on general is computationally intractable, but recent work has shown that there exist infinite families sparse structured which it possible to derive efficient enumerative formulas. In this paper, we consider case trees and forests fixed size, proposing an algorithm based matrix algebra approximate distribution numbers. We also present model application machine learning enumeration problems setting, demonstrating standard regression techniques can be applied type structure.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stirling Numbers and Generalized Zagreb Indices

We show how generalized Zagreb indices $M_1^k(G)$ can be computed by using a simple graph polynomial and Stirling numbers of the second kind. In that way we explain and clarify the meaning of a triangle of numbers used to establish the same result in an earlier reference.

متن کامل

A generalized recurrence formula for Stirling numbers and related sequences

In this note, we provide a combinatorial proof of a generalized recurrence formula satisfied by the Stirling numbers of the second kind. We obtain two extensions of this formula, one in terms of r-Whitney numbers and another in terms of q-Stirling numbers of Carlitz. Modifying our proof yields analogous formulas satisfied by the r-Stirling numbers of the first kind and by the r-Lah numbers.

متن کامل

Congruences on Stirling Numbers and Eulerian Numbers

In this paper, we establish some Fleck-Weisman type congruences for the Stirling numbers and the Eulerian numbers.

متن کامل

Log-concavity of Stirling Numbers and Unimodality of Stirling Distributions

A series of inequalities involving Stirling numbers of the first and second kinds with adjacent indices are obtained. Some of them show log-concavity of Stirling numbers in three different directions. The inequalities are used to prove unimodality or strong unimodality of all the subfamilies of Stirling probability functions. Some additional applications are also presented.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Algorithms

سال: 2023

ISSN: ['1999-4893']

DOI: https://doi.org/10.3390/a16050223